Asymptotically Optimal Randomized Tree Embedding in Static Networks
نویسنده
چکیده
The problem of dynamic tree embedding in static networks is studied in this paper. We provide a unified framework for studying the performance of randomized tree embedding algorithms which allow a newly created tree node to take a random walk of a short distance to reach a processor nearby. In particular, we propose simple randomized algorithms on several most common and important static networks, including d-dimensional meshes, ddimensional tori, and hypercubes. It is shown that these algorithms, which have a small constant dilation, are asymptotically optimal. Our analysis technique is based on random walks on static networks. Hence, analytical expressions for expected load on all the processors are available.
منابع مشابه
Asymptotically Optimal Randomized Tree Embedding in Static Networks Asymptotically Optimal Randomized Tree Embedding in Static Networks
{ The problem of dynamic tree embedding in static networks is studied in this paper. We provide a uniied framework for studying the performance of randomized tree embedding algorithms which allow a newly created tree node to take a random walk of a short distance to reach a processor nearby. In particular, we propose simple randomized algorithms on several most common and important static netwo...
متن کاملA Comparative Performance Evaluation of Randomized Tree Embedding in Hypercubic Networks
{ An important problem in parallel computing is to embed a task interaction graph into a static network. Dynamic embedding is performed at run-time, where the task interaction graph is not known in advance. In this paper, we investigate the performance of randomized embedding of tree-structured parallel computations (i.e., where the task interaction graph is a tree) into the classic hypercubic ...
متن کاملEmbedding Complete Binary Trees into Star Networks
Abs t rac t . Star networks have been proposed as a possible interconnection network for massively parallel computers. In this paper we investigate embeddings of complete binary trees into star networks. Let G and H be two networks represented by simple undirected graphs. An embedding of G into H is an injective mapping f from the vertices of G into the vertices of H. The dilation of the embedd...
متن کاملDynamic Programming Principles for Sampling-based Motion Planners
Recent randomized asymptotically optimal motion planners incrementally construct an approximate, discrete, sparse representation of the underlying continuous search space, and use locally optimal solutions, along with a local reassignment of the edges, to obtain optimal solutions encoded in the current graph/tree data structure. Careful analysis reveals that all these algorithms can be interpre...
متن کاملInformation Gathering in Ad-Hoc Radio Networks with Tree Topology
We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. Our goal is to design protocols that deliver all rumors to the root of the tree as quickly as possible. The protocol must complet...
متن کامل